A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability

GRASP: A Search Algorithm for Propositional Satisfiability

ÐThis paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), a new search algorithm for Propositional Satisfiability (SAT). GRASP incorporates several search-pruning techniques that proved to be quite powerful on a wide variety of SAT problems. Some of these techniques are specific to SAT, whereas others are similar in spirit to approaches in other fields of Artificia...

A Complete Adaptive Algorithm for Propositional Satisfiability

An approach to propositional satisfiability using an adaptive procedure is described. Its main feature is a new branching rule, which is able to identify, at an early stage, hard sub-formulae. Such branching rule is based on a simple and easy computable criterion, whose merit function is updated by a learning mechanism, and guides the exploration of a clause based branching tree. Completeness i...

CLAS: a Complete Learning Algorithm for propositional Satisfiability

In this paper an approach is described for solving propositional Satisfiability problems, which makes use of an adaptive technique. Its main feature is a new enumeration scheme, which is able to identify, at an early stage, hard sub-formulae. This scheme is based on a simple and easy computable criterion, whose merit function is updated by a learning mechanism, and guides the exploration of a c...

Satisfiability for Propositional Contexts

We propose a sound and complete satisfiability algorithm for propositional multi-context systems. In essence, the algorithm is a distribution policy built on top of local reasoning procedures, one for each context, which can be implemented by (a diversity of) customized state-of-the-art SAT solvers. The foremost intuition that has motivated our algorithm, and the very potential strength of cont...

Propositional Satisfiability Algorithm to Find Minimal Reducts for Data Mining